Reconstructing phylogeny by Quadratically Approximated Maximum Likelihood
نویسندگان
چکیده
منابع مشابه
Reconstructing phylogeny by Quadratically Approximated Maximum Likelihood
Maximum likelihood (ML) for phylogenetic inference from sequence data remains a method of choice, but has computational limitations. In particular, it cannot be applied for a global search through all potential trees when the number of taxa is large, and hence a heuristic restriction in the search space is required. In this paper, we derive a quadratic approximation, QAML, to the likelihood fun...
متن کاملDPRml: distributed phylogeny reconstruction by maximum likelihood
MOTIVATION In recent years there has been increased interest in producing large and accurate phylogenetic trees using statistical approaches. However for a large number of taxa, it is not feasible to construct large and accurate trees using only a single processor. A number of specialized parallel programs have been produced in an attempt to address the huge computational requirements of maximu...
متن کاملParallel Divide-and-Conquer Phylogeny Reconstruction by Maximum Likelihood
Phylogenetic trees are important in biology since their applications range from determining protein function to understanding the evolution of species. Maximum Likelihood (ML) is a popular optimization criterion in phylogenetics. However, inference of phylogenies with ML is NP-hard. Recursive-Iterative-DCM3 (Rec-I-DCM3) is a divideand-conquer framework that divides a dataset into smaller subset...
متن کاملFast Parallel Maximum Likelihood-Based Protein Phylogeny
Inferring phylogenetic relationships between sequences is a difficult and interesting problem. Assuming that there is enough phylogenetic signal in biological sequence to resolve every tree bifurcation, the resulting tree is a representation of the vertical descent history of a gene. A popular method to evaluate a candidate phylogenetic tree uses the likelihood of the data, given an empirical m...
متن کاملParallel Inference of a 10.000-Taxon Phylogeny with Maximum Likelihood
Inference of large phylogenetic trees with statistical methods is computationally intensive. We recently introduced simple heuristics which yield accurate trees for synthetic as well as real data and are implemented in a sequential program called RAxML. We have demonstrated that RAxML outperforms the currently fastest statistical phylogeny programs (MrBayes, PHYML) in terms of speed and likelih...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2004
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/bth926